Publicly Verfiable Secret Sharing from Paillier's Cryptosystem
نویسندگان
چکیده
In this paper we propose a simple PVSS scheme based on the homomorphic properties of Paillier’s encryption scheme. This new scheme is the first known PVSS scheme based on the decisional composite residuosity assumption. The verification process in this scheme is much simpler than in the other known schemes. Furthermore, in our proposal, verification is made non-interactive without using the Fiat-Shamir technique or any additional Zero Knowledge proof.
منابع مشابه
A Fast Publicly Verifiable Secret Sharing Scheme using Non-homogeneous Linear Recursions
A non-interactive (t,n)-publicly veriable secret sharing scheme (non-interactive (t,n)-PVSS scheme) is a (t,n)-secret sharing scheme in which anyone, not only the participants of the scheme, can verify the correctness of the produced shares without interacting with the dealer and participants. The (t,n)-PVSS schemes have found a lot of applications in cryptography because they are suitable for<...
متن کاملPublicly Veriiable Secret Sharing
A secret sharing scheme allows to share a secret among several participants such that only certain groups of them can recover it. Veriiable secret sharing has been proposed to achieve security against cheating participants. Its rst realization had the special property that everybody, not only the participants, can verify that the shares are correctly distributed. We will call such schemes publi...
متن کاملPublicly Veri able Secret Sharing
A secret sharing scheme allows to share a secret among several participants such that only certain groups of them can recover it. Veri able secret sharing has been proposed to achieve security against cheating participants. Its rst realization had the special property that everybody, not only the participants, can verify that the shares are correctly distributed. We will call such schemes publi...
متن کاملComputationally secure multiple secret sharing: models, schemes, and formal security analysis
A multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants. in such a way a multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants, such that any authorized subset of participants can reconstruct the secrets. Up to now, existing MSSs either require too long shares for participants to be perfect secur...
متن کاملImproving the Rao-Nam secret key cryptosystem using regular EDF-QC-LDPC codes
This paper proposes an efficient joint secret key encryption-channel coding cryptosystem, based on regular Extended Difference Family Quasi-Cyclic Low-Density Parity-Check codes. The key length of the proposed cryptosystem decreases up to 85 percent using a new efficient compression algorithm. Cryptanalytic methods show that the improved cryptosystem has a significant security advantage over Ra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005